منابع مشابه
Further results on odd mean labeling of some subdivision graphs
Let G(V,E) be a graph with p vertices and q edges. A graph G is said to have an odd mean labeling if there exists a function f : V (G) → {0, 1, 2,...,2q - 1} satisfying f is 1 - 1 and the induced map f* : E(G) → {1, 3, 5,...,2q - 1} defined by f*(uv) = (f(u) + f(v))/2 if f(u) + f(v) is evenf*(uv) = (f(u) + f(v) + 1)/2 if f(u) + f(v) is odd is a bijection. A graph that admits an odd mean labelin...
متن کاملSome algorithmic results for [2]-sumset covers
Let X = {xi : 1 ≤ i ≤ n} ⊂ N, and h ∈ N. The h-iterated sumset of X, denoted hX, is the set {x1 + x2 + . . . + xh : x1, x2, . . . , xh ∈ X}, and the [h]sumset of X, denoted [h]X, is the set ⋃h i=1 iX. A [h]-sumset cover of S ⊂ N is a set X ⊂ N such that S ⊆ [h]X. In this paper, we focus on the case h = 2, and study the APX-hard problem of computing a minimum cardinality [2]-sumset cover X of S ...
متن کاملOn Some Tighter Inapproximability Results, Further Improvements
Improved inaproximability results are given, including the best up to date explicit approximation thresholds for bounded occurence sat-issability problems, like MAX-2SAT and E2-LIN-2, and problems in bounded degree graphs, like MIS, Node Cover and MAX CUT. We prove also for the rst time inapproximability of the problem of Sorting by Reversals and display an explicit approximation threshold for ...
متن کاملSome Further Results on the Recovery Algorithms
When seeking a representation of a signal on a redundant basis one generally replaces the quest for the sparsest model by an `1 minimization and solves thus a linear program. In the presence of noise one has in addition to replace the exact reconstruction constraint by an approximate one. We consider simultaneously several ways to allow for reconstruction errors and detail the optimality condit...
متن کاملSome Further Results on Digital Search Trees
Our purpose in this paper is the study of digital search trees, (binary) tries and Patricia tries ; a wealth of information about these. important data structures can be found in Knuth's book (2] ; compare also Flajolet and Sedgewick (1] . Considering digital search trees, we assume that each item has a key being an infinite sequence of 0 and 1, where 0 means "go left" and 1 means "go right", u...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Topology and its Applications
سال: 2013
ISSN: 0166-8641
DOI: 10.1016/j.topol.2013.07.035